An Improved Raft Consensus Algorithm Based on Asynchronous Batch Processing
نویسندگان
چکیده
Abstract The consensus algorithm has been popular in current distributed systems as it is more effective solving server unreliability. It ensures a group of servers can form coordinated system, and the entire system continues to work when part service point fails. Raft well-known widely used algorithm, but built-in purpose comprehensibility, always compromised terms performance trade-off. In this paper, we mainly aim improve traditional algorithm’s problem, especially high concurrency scenarios. We introduce pre-proposal stage on top achieve efficiency optimization through batch asynchronous log replicated disk flushing. experiment proved that improved could increase throughput by 2–3.6 times, processing for parallel requests be increased 20% or more.
منابع مشابه
An improved memetic algorithm to minimize earliness–tardiness on a single batch processing machine
In this research, a single batch processing machine scheduling problem with minimization of total earliness and tardiness as the objective function is investigated.We first formulate the problem as a mixed integer linear programming model. Since the research problem is shown to be NP-hard, an improved memetic algorithmis proposed to efficiently solve the problem. To further enhance the memetic ...
متن کاملAn improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
We consider the problem of on-line scheduling a set of n jobs on two parallel batch processing machines. Each machine can handle an infinite number of jobs as a batch simultaneously. The processing time of a batch is the time required for processing the longest job in the batch. Each job becomes available at its release date, which is not known in advance, and its processing time only becomes k...
متن کاملAN IMPROVED INTELLIGENT ALGORITHM BASED ON THE GROUP SEARCH ALGORITHM AND THE ARTIFICIAL FISH SWARM ALGORITHM
This article introduces two swarm intelligent algorithms, a group search optimizer (GSO) and an artificial fish swarm algorithm (AFSA). A single intelligent algorithm always has both merits in its specific formulation and deficiencies due to its inherent limitations. Therefore, we propose a mixture of these algorithms to create a new hybrid optimization algorithm known as the group search-artif...
متن کاملAn improved opposition-based Crow Search Algorithm for Data Clustering
Data clustering is an ideal way of working with a huge amount of data and looking for a structure in the dataset. In other words, clustering is the classification of the same data; the similarity among the data in a cluster is maximum and the similarity among the data in the different clusters is minimal. The innovation of this paper is a clustering method based on the Crow Search Algorithm (CS...
متن کاملAn Improved WAGNER-WHITIN Algorithm
We present an improved implementation of the Wagner-Whitin algorithm for economic lot-sizing problems based on the planning-horizon theorem and the Economic- Part-Period concept. The proposed method of this paper reduces the burden of the computations significantly in two different cases. We first assume there is no backlogging and inventory holding and set-up costs are fixed. The second model ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Electrical Engineering
سال: 2022
ISSN: ['1876-1100', '1876-1119']
DOI: https://doi.org/10.1007/978-981-19-2456-9_44